Declaring Constraints on Object-oriented Collections
نویسندگان
چکیده
منابع مشابه
Declaring Constraints on Object-oriented Collections
Logic puzzles such as Sudoku are described by a set of properties that a valid solution must have. Constraints are a useful technique to describe and solve for such properties. However, constraints are less suited to express imperative interactions in a user interface for logic puzzles, a domain that is more readily expressed in the objectoriented paradigm. Object constraint programming provide...
متن کاملConstraints in Object-Oriented Analysis
Object-oriented analysis methods can incorporate the concept of constraints to express rules of the problem domain in the specification model, restricting the possible instances of the model. As such, constraints describe properties that must be true at each moment in time for the entire system, without determining how they are to be preserved. The ways in which these constraints are introduced...
متن کاملObject - Oriented Refactoring , Legacy Constraints
Legacy constraints can impede reuse eeorts in industrial settings. In this position paper, I rst describe some of the results of my research into refactoring object-oriented software; refactoring is a means for achieving evolution and reuse in the midst of legacy constraints. Then, I discuss some insights gained from recent eeorts to encourage reuse in industrial settings.
متن کاملDescriptions as Constraints in Object-Oriented Representation
A m o t i v a t i o n i s g i ven to i n t r o d u c e i n d e f i n i t e d e s c r i p t i o n s . Par ts o f a d e s c r i p t i o n language are p r e s e n t e d . Mechanisms for the i n t e r p r e t a t i o n o f i n d e f i n i t e des c r i p t i o n s are b r i e f l y d i s c u s s e d .
متن کاملConstraints in an Object-Oriented Deductive Database
approximation sequences are easier to generate because the cost of the abstract computation is independent from the database size. However, this is still a sound and complete procedure: Theorem [Ca91b]: A completed database instance v is a solution of (d0, C) iff there exists an abstract approximation sequence (d i) such that dn = v. We can also define abstract fixpoint approximation sequence, ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Information Processing
سال: 2016
ISSN: 1882-6652
DOI: 10.2197/ipsjjip.24.917